General Sparse Elimination Requires No Permanent Integer Storage
نویسنده
چکیده
General sparse elimination is designed to take maximum advantage of the sparsity of an N ×N matrix A. Only the nonzeros of A are stored, along with some extra integer overhead to identify the nonzero matrix elements. This extra integer storage may be avoided for the triangular factors generated by an LDU decomposition, generally without increasing the order of complexity. In addition to permanent storage for the nonzero elements of the factors, our procedure requires at most 5N temporary integer storage.
منابع مشابه
On the Complexity of Sparse Gaussian Elimination via Bordering
The complexity of a general sparse Gaussian elimination algorithm based on the bordering algorithm is analyzed. It has been shown that this procedure requires less integer overhead storage than more traditional general sparse procedures, but the complexity of the nonnumerical overhead calculations was not clear. Here the nonnumerical complexity of the original procedure is shown to be comparabl...
متن کاملA Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some prelim...
متن کاملImplementation of Nested Dissection Method Using Block Elimination
In this paper, we consider the problem of solving an 2 2 n n sparse positive definite system b AU , arising from the use of finite difference methods to solve an elliptic boundary value problem on an n n mesh where 1 2 k n where k is a positive integer. The large sparse linear system can be solved directly in an efficient way using nested dissection method, originally proposed by Alan...
متن کاملBlock local elimination algorithms for solving sparse discrete optimization problems
Block elimination algorithms for solving sparse discrete optimization problems are considered. The numerical example is provided. The benchmarking is done in order to define real computational capabilities of block elimination algorithms combined with SYMPHONY solver. Analysis of the results show that for sufficiently large number of blocks and small enough size of separators between the blocks...
متن کاملSparse Gaussian Elimination Modulo p: An Update
This paper considers elimination algorithms for sparse matrices over finite fields. We mostly focus on computing the rank, because it raises the same challenges as solving linear systems, while being slightly simpler. We developed a new sparse elimination algorithm inspired by the GilbertPeierls sparse LU factorization, which is well-known in the numerical computation community. We benchmarked ...
متن کامل